Pedestrian navigation and shortest path: Preference versus distance
نویسندگان
چکیده
Contemporary digital maps provide an option for pedestrian navigation, but they do not account for subjective preferences in the calculation of the shortest path, which is usually provided in terms of absolute distance. For this purpose, we performed a controlled experiment with local pedestrians, who were asked to navigate from point A to point B in a fast manner. The pedestrians’ routes were recorded by means of a GPS device and then plotted on a map for comparison with suggested itinerary from a digital map. We found that the preferred shortest path is significantly different to the suggested one. Notably, the preffered paths were slightly longer than the suggested, but there was no effect in the trip duration because there were fewer obstacles, such as cars. Since many pedestrians employ GPS enabled devices, the findings of this research inform the development of mobile applications and the design of new subjective map layers for city dwellers.
منابع مشابه
A Navigation Algorithm for Pedestrian Simulation in Dynamic Environments
In this paper we introduce a novel online path planning method that mimics the human sense of navigation for finding a path between the current location (the ‘origin’) and the destination point. Most pedestrian simulation systems pre-compute a minimum cost (e.g. shortest length) path. Such an approach implies that the simulated agents have perfect knowledge of the infrastructure. Moreover, pre-...
متن کاملMonitoring Pedestrian Spatio-Temporal Behaviour
One of the major issues in the development of mobile pedestrian navigation services concerns the poor understanding of pedestrian spatiotemporal behaviour. Findings reveal that human route choice behaviour relies on a huge variety of influence factors. Therefore, common concepts like those used in car navigation systems will not conform to the requirements of pedestrians, as people on foot do n...
متن کاملSolving the Direction Field for Discrete Agent Motion
Models for pedestrian dynamics are often based on microscopic approaches allowing for individual agent navigation. To reach a given destination, the agent has to consider environmental obstacles. We propose a direction field calculated on a regular grid with a Moore neighborhood, where obstacles are represented by occupied cells. Our developed algorithm exactly reproduces the shortest path with...
متن کاملMulti Exit Configuration of Mesoscopic Pedestrian Simulation
A mesoscopic approach to modeling pedestrian simulation with multiple exits is proposed in this paper. A floor field based on Qlearning Algorithm is used. Attractiveness of exits to pedestrian typically is based on shortest path. However, several factors may influence pedestrian choice of exits. Scenarios with multiple exits are presented and effect of Q-learning rewards system on navigation is...
متن کاملThe use of dynamic distance potential fields for pedestrian flow around corners
This contribution investigates situations in pedestrian dynamics, where trying to walk the shortest path leads to largely different results than trying to walk the quickest path. A heuristic one-shot method to model the influence of the will to walk the quickest path is
متن کامل